theor of computability

См. также в других словарях:

• Сверхтьюринговые вычисления — Сверхтьюринговыми вычислениями (или гипервычислениями (англ. hypercomputation)) называются такие вычисления, которые не могут быть проделаны на машине Тьюринга. Они включают в себя разнообразные гипотетические методы, основанные на… …   Википедия

• Hypercomputation — refers to various hypothetical methods for the computation of non Turing computable functions (see also supertask). The term was first introduced in 1999 by Jack Copeland and Diane Proudfoot [Copeland and Proudfoot,… …   Wikipedia

• Malament-Hogarth spacetime — A Malament Hogarth (M H) spacetime, named after David B. Malament and Mark Hogarth, is a relativistic spacetime that possesses the following property: there exists a worldline lambda and an event p such that all events along lambda are a finite… …   Wikipedia

• Malament–Hogarth spacetime — A Malament–Hogarth (M H) spacetime, named after David B. Malament and Mark Hogarth, is a relativistic spacetime that possesses the following property: there exists a worldline λ and an event p such that all events along λ are a finite interval in …   Wikipedia

• Post correspondence problem — The Post correspondence problem is an undecidable decision problem that was introduced by Emil Post in 1946.[1] Because it is simpler than the halting problem and the Entscheidungsproblem it is often used in proofs of undecidability. Contents 1… …   Wikipedia

• Billiard-ball computer — [ Fredkin and Toffoli Gate Billiard Ball Model] A billiard ball computer as in ref|penr is an idealized model of a computing machine based on Newtonian dynamics. Instead of using electronic signals like a conventional computer, it relies on the… …   Wikipedia

• Combinatorics on words — Construction of a Thue Morse infinite word Combinatorics on words is a branch of mathematics which applies combinatorics to words and formal languages. The study of combinatorics on words arose independently within several branches of mathematics …   Wikipedia